Authenticating Visual Cryptography Shares Using 2D Barcodes

نویسندگان

  • Jonathan Weir
  • WeiQi Yan
چکیده

One of the problems pertinent with many visual cryptography (VC) schemes is that of authentication. VC provides a way of sharing secrets between a number of participants. The secrets are in the form of an image that is encoded into multiple pieces known as shares. When these shares are physically superimposed, the secret can be instantly observed. A known problem is that of authentication. How is it possible to know that the secret being recovered is genuine? There has been some work devoted to this using so called cheating prevention schemes which attempt to provide a means of traceability or authentication via a set of additional shares that are used to check authenticity. This paper proposes a scheme that attempts to alleviate this suspicion by using 2D barcodes as a means of authentication which may have more practicality in terms of real world usage. Results are provided using an application that is available on mobile devices for portable barcode reading.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

مطالعه‌ای بر رمز‌نگاری بصری و ارائه‌ی روش پیشنهادی برای رمزنگاری تصاویر رنگی

Visual cryptography is a method that makes use of the characteristics of human vision and it requires neither the knowledge of cryptography nor the complex calculations. This method was first proposed by Naor and Shamir, its implementation is simple, it has been extended to an secrect sharing (k, n) in which n shares are made from the image and they are distributed among n participants. Moreov...

متن کامل

On the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes

In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...

متن کامل

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

Performance of Error Filters on Shares in Halftone Visual Cryptography via Error Diffusion

Visual cryptography encodes a secret binary image (SI) into shares of random binary patterns. The decoding process of a visual cryptography scheme, which differs from traditional secret sharing, does not need any cryptographic algorithms like symmetric and asymmetric algorithms. Visual cryptography is based on the images and is obtained by sending pixel information and stacking of pixels for re...

متن کامل

Rotation Visual Cryptography Using Basic ( 2 , 2 ) Scheme

Visual cryptography scheme is the concept of encrypting a secret image into n(more than one) shares. Rotation Visual Cryptography scheme (RVCS) allows four secret images to be encrypted into two shares. Using Human Visual System, again the four secret images can be easily recovered by placing the two shares on top of each other with different angles. In this paper proposes a Rotation Visual Cry...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011